منابع مشابه
Knots in Graphs in Subsets
The probability that an embedding of a graph in Z 3 is knotted is investigated. For any given graph (embeddable in Z 3) without cut edges, it is shown that this probability approaches 1 at an exponential rate as the number of edges in the embedding goes to innnity. Furthermore, at least for a subset of these graphs, the rate at which the probability approaches 1 does not depend on the particula...
متن کاملControllable-Choice Message Sequence Graphs
We focus on the realizability problem of Message Sequence Graphs (MSG), i.e. the problem whether a given MSG specification is correctly distributable among parallel components communicating via messages. This fundamental problem of MSG is known to be undecidable. We introduce a well motivated restricted class of MSG, so called controllable-choice MSG, and show that all its models are realizable...
متن کاملDetection of structurally homogeneous subsets in graphs
The analysis of complex networks is a rapidly growing topic with many applications in different domains. The analysis of large graphs is often made via unsupervised classification of vertices of the graph. Community detection is the main way to divide a large graph into smaller ones that can be studied separately. However another definition of a cluster is possible, which is based on the struct...
متن کاملOn the construction of Q-controllable graphs
A connected graph is called Q-controllable if its signless Laplacian eigenvalues are mutually distinct and main. Two graphs G and H are said to be Q-cospectral if they share the same signless Laplacian spectrum. In this paper, infinite families of Q-controllable graphs are constructed, by using the operator of rooted product introduced by Godsil and McKay. In the process, infinitely many non-is...
متن کاملUniversal Point Subsets for Planar Graphs
A set S of k points in the plane is a universal point subset for a class G of planar graphs if every graph belonging to G admits a planar straight-line drawing such that k of its vertices are represented by the points of S. In this paper we study the following main problem: For a given class of graphs, what is the maximum k such that there exists a universal point subset of size k? We provide a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Combinatorics
سال: 2012
ISSN: 0218-0006,0219-3094
DOI: 10.1007/s00026-012-0156-3